Slicing Methods Using Static and Dynamic Analysis Information

نویسندگان

  • Yoshiyuki Ashida
  • Fumiaki Ohata
  • Katsuro Inoue
چکیده

In this paper, we propose four slicing methods using both static and dynamic analysis information. (1) StatementMark Slice : removes the unnecessary statements using an execution history of the statements. (2) Partial Program Analysis : reduces the static analysis cost using invocation history of procedures. (3) Dynamic Data Dependence Analysis : extracts precise data dependence relations using dynamic data dependence analysis. (4) Array and Pointer Analysis : improves the efficiency of (3) by dynamically analyzing pointer and array variables only. Using both dynamic and static information, we will show that the precision of the slicing is improved with smaller run-time overhead.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Slicing Method for Object-Oriented Programs Using Lightweight Dynamic Information

Program slicing has been used for efficient program debugging activities. Program slice is computed by analyzing dependence relations between program statements. We can divide dependence analyses into two categories, static and dynamic; the former requires little analysis costs, but the resulting slices are large. The latter has opposite characters. In this paper, we propose a program slicing m...

متن کامل

Dependence-Cache Slicing: A Program Slicing Method Using Lightweight Dynamic Information

When we try to debug or to comprehend a large program, it is important to separate suspicious program portions from the overall source program. Program slicing is a promising technique used to extract a program portion; however, such slicing sometimes raises difficulties. Static slicing sometimes produces a large portion of a source program, especially for programs with array and pointer variab...

متن کامل

A New Method to Compute Dynamic Slicing using Program Dependence Graph

Program slicing is one of the techniques of program analysis that allows an analyst to automatically extract portions of programs relevant to the program being analyzed. It is an alternative approach to develop reusable components from existing software. It is a very important part of software development and maintenance. It is used in a number of applications such as program analysis, program ...

متن کامل

Slicing of Constraint Logic Programs

Abstract. Slicing is a program analysis technique originally developed for imperative languages. It facilitates understanding of data flow and debugging. This paper discusses slicing of Constraint Logic Programs. Constraint Logic Programming (CLP) is an emerging software technology with a growing number of applications. Data flow in constraint programs is not explicit, and for this reason the c...

متن کامل

Prioritized Static Slicing for Effective Fault Localization in the Absence of Runtime Information

Static slicing identifies the parts of a program that might affect another point in that program. Unfortunately, static slicing often produces large and imprecise results because of its conservative nature. Dynamic slicing can be a practical alternative, but it requires runtime information that might not be available, or be hard to obtain, or have low quality. To deal with the imprecision of st...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999